Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes
نویسندگان
چکیده
منابع مشابه
MDP Periodically Time-Varying Convolutional Codes
In this paper we use some classical ideas from linear systems theory to analyse convolutional codes. In particular, we exploit input-state-output representations of periodic linear systems to study periodically time-varying convolutional codes. In this preliminary work we focus on the column distance of these codes and derive explicit necessary and sufficient conditions for an (n, 2, 1) periodi...
متن کاملTwo-Dimensional Tail-Biting Convolutional Codes
The multidimensional convolutional codes are an extension of the notion of convolutional codes (CCs) to several dimensions of time. This paper explores the class of twodimensional convolutional codes (2D CCs) and 2D tail-biting convolutional codes (2D TBCCs ), in particular, from several aspects. First, we derive several basic algebraic properties of these codes, applying algebraic methods in o...
متن کاملCharacteristic Matrices and Trellis Reduction for Tail-Biting Convolutional Codes
Basic properties of a characteristic matrix for a tail-biting convolutional code are investigated. A tail-biting convolutional code can be regarded as a linear block code. Since the corresponding scalar generator matrix G has a kind of cyclic structure, an associated characteristic matrix also has a cyclic structure, from which basic properties of a characteristic matrix are obtained. Next, usi...
متن کاملDistance bounds for convolutional codes and some optimal codes
After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used for deriving a lower bound for the field size of an MDS convolutional code and examples are presented showing that, in most cases, the lower bound is tight. ...
متن کاملMinimum distance and pseudodistance lower bounds for generalised LDPC codes
Abstract: Two different ways of obtaining generalized low-density parity-check codes are considered. Lower bounds on the minimum distance, stopping distance, and pseudodistance are derived for these codes using graph based analysis. These bounds are generalizations of Tanner’s bit-oriented and parity-oriented bound for simple LDPC codes. The new bounds are useful in predicting the performance o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2053873